Approximation Algorithms for Optimization of Combinatorial Dynamical Systems
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Combinatorial Optimization
In combinatorial optimization, the most important challenges are presented by problems belonging to the class NP-hard. For such problems no algorithm is known that can solve all instances in polynomial time. It is also strongly believed that no polynomial algorithm is capable of doing this. Although it is very difficult to solve exactly any of the NP-hard problems, some of them are amenable to ...
متن کاملApproximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wx over an arbitrary combinatorial feasible set F ⊂ {0, 1}n. For these problems we describe a broad class of corresponding stochastic problems where the cost vector W has independent random components, unknown at the time of solution. A natural and important objective that incorporates risk in...
متن کاملApproximation algorithms for combinatorial optimization under uncertainty
Combinatorial optimization problems arise in many fields of industry and technology, where they are frequently used in production planning, transportation, and communication network design. Whereas in the context of classical discrete optimization it is usually assumed that the problem inputs are known, in many real-world applications some of the data may be subject to an uncertainty, often bec...
متن کاملApproximation Algorithms for Combinatorial Multicriteria Optimization Problems
The computational complexity of combinatorial multiple objective programming problems is investigated. INP-completeness and #P-completeness results are presented. Using two deenitions of approximability, general results are presented, which outline limits for approximation algorithms. The performance of the well known tree and Christoodes' heuristics for the TSP is investigated in the multicrit...
متن کاملCSC 5160 : Combinatorial Optimization and Approximation Algorithms
In this lecture, the focus is on submodular function in combinatorial optimizations. The first class of submodular functions which was studied thoroughly was the class of matroid rank functions. The flourishing stage of matroid theory came with Jack Edmonds’ work in 1960s, when he gave a minmax formula and an efficient algorithm to the matroid partition problem, from which the matroid intersect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2016
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2015.2504867